منابع مشابه
Combinatorics of Finite Geometries
85 admirably clear. While the book is devoted to a single problem, the techniques employed would seem to have wider utility, and so should appeal to those interested in efficiency of algorithms in graph theory, and further (perhaps) to those wishing to apply such ideas to the real world. I enjoyed reading this book. It is written in a way which should appeal to advanced undergraduate and postgr...
متن کاملFully packed loop models on finite geometries
A fully packed loop (FPL) model on the square lattice is the statistical ensemble of all loop configurations, where loops are drawn on the bonds of the lattice, and each loop visits every site once [4,18]. On finite geometries, loops either connect external terminals on the boundary, or form closed circuits, see for example Figure 1. In this chapter we shall be mainly concerned with FPL models ...
متن کاملFinite Field Theory on Noncommutative Geometries
The propagator is calculated on a noncommutative version of the flat plane and the Lobachevsky plane with and without an extra (euclidean) time parameter. In agreement with the general idea of noncommutative geometry it is found that the limit when the two ‘points’ coincide is finite and diverges only when the geometry becomes commutative. The flat 4-dimensional case is also considered. This is...
متن کاملNote on Lie algebras , finite groups and finite geometries
The subject of this note began with Thompson [Thl,2]. In the course of constructing his simple group Th, he considered the Lie algebra Lover iC of type Es. He constructed a decomposition L H1 ..L ... ..L H31 using a family H. {H1, ... , H31 } of Cartan algebras that are pairwise perpendicular with respect to the Killing form (he called this a "Dempwolff decomposition" of L; the construction was...
متن کاملToric codes and finite geometries
We show how the theory of affine geometries over the ring Z/〈q−1〉 can be used to understand the properties of toric and generalized toric codes over Fq. The minimum distance of these codes is strongly tied to the collections of lines in the finite geometry that contain subsets of the exponent vectors of the monomials that are evaluated to produce the standard generator matrix for the code. We a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1985
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90037-8